Efficient Congestion Mitigation Using Congestion-Aware Steiner Trees and Network Coding Topologies
نویسندگان
چکیده
منابع مشابه
Optimal network topologies for local search with congestion
The problem of searchability in decentralized complex networks is of great importance in computer science, economy, and sociology. We present a formalism that is able to cope simultaneously with the problem of search and the congestion effects that arise when parallel searches are performed, and we obtain expressions for the average search cost both in the presence and the absence of congestion...
متن کاملManaging Congestion in Data Center Network using Congestion Notification Algorithms
1Student, Dept. of Computer Engineering, PICT, Pune, India 2Professor, Dept. of Computer Engineering, PICT, Pune, India ---------------------------------------------------------------------***--------------------------------------------------------------------Abstract With the rapid growth in Data Center Network (DCN), many problems are observed by the researchers. These problems are related to...
متن کاملCongestion Aware Spray And Wait Protocol: A Congestion Control Mechanism For The Vehicular Delay Tolerant Network
In the last few years, the Vehicular Ad-hoc Network (VANET) has come to be an important area of research. Significant research has been conducted to improve the performance of VANETS. One output of further research conducted on VANET is the Vehicular Delay Tolerant Network (VDTN). It is an application of the mobile DTN where nodes relay messages in the network using a store-carry-forward approa...
متن کاملNetwork congestion control using NetFlow
The goal of congestion control is to avoid congestion in network elements. A network element is congested if it is being offered more traffic than it can process. To detect such situations and to neutralize them we should monitor traffic in the network. In this paper, we propose using Cisco’s NetFlow technology, which allows collecting statistics about traffic in the network by generating speci...
متن کاملMinimal congestion trees
Let G be a graph and let T be a tree with the same vertex set. Let e be an edge of T and Ae and Be be the vertex sets of the components of T obtained after removal of e. Let EG(Ae, Be) be the set of edges of G with one endvertex in Ae and one endvertex in Be. Let ec(G : T ) := max e |EG(Ae, Be)|. The paper is devoted to minimization of ec(G : T ) • Over all trees with the same vertex set as G. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: VLSI Design
سال: 2011
ISSN: 1065-514X,1563-5171
DOI: 10.1155/2011/892310